翻訳と辞書 Words near each other ・ sasd ・ sase ・ sasi ・ sasl ・ sasl+lv ・ sasl-yacc ・ sata ・ satan ・ sather ・ sather-k ・ satisfiability problem ・ saturation ・ saturday-night special ・ save ・ save as ・ say ・ sb ・ sb awe32 ・ sb-prolog ・ sbcs Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク satisfiability problem ： FOLDOC satisfiability problem A problem used as an example in {complexity theory}. It can be stated thus: Given a Boolean expression E, decide if there is some assignment to the variables in E such that E is true. A Boolean expression is composed of Boolean variables, (logical) negation (NOT), (logical) conjunction (AND) and parentheses for grouping. The satisfiability problem was the first problem to be proved to be NP-complete (by Cook). ["Introduction to Automata Theory, Languages, and Computation" by Hopcroft and Ullman, pub. Addison-Wesley]. (1994-11-11) スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.